Probabilistic Semantics
نویسنده
چکیده
This paper proposes a concise overview of Probabilistic Semantics according to a technologyoriented perspective. Indeed, while the progressive consolidation of Semantic Technology in a wide context and on a large scale is going to be a fact, the non-deterministic character of many problems and environments suggests the rise of additional researches around semantics to integrate the mainstream. Probabilistic extensions and their implications to the current semantic ecosystems are discussed in this paper with an implicit focus on the Web and its evolution. The critical literature review undertaken shows valuable theoretical works, effective applications, evidences of an increasing research interest as the response to real problems, as well as largely unexplored research areas.
منابع مشابه
Non-monotonic Negation in Hybrid Probabilistic Logic Programs
In [23], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [23] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and ...
متن کاملHybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this paper, we extend the language of Hybrid Probabilistic Logic Programs framework in [20] to allow non-monotonic negation, and define two alternative semantics: stable probabilistic model semantics and probabilistic wel...
متن کاملAbstract Interpretation of Probabilistic Semantics
interpretation of probabilistic semantics
متن کاملA Semantics for Probabilistic Control-Flow Graphs
This article develops a novel operational semantics for probabilistic control-flow graphs (pCFGs) of probabilistic imperative programs with random assignment and “observe” (or conditioning) statements. The semantics transforms probability distributions (on stores) as control moves from one node to another in pCFGs. We relate this semantics to a standard, expectation-transforming, denotational s...
متن کاملTesting Semantics for a Probabilistic-Timed Process Algebra
In this paper we present a probabilistic-timed process algebra, which try to unify the best solutions of previous probabilistic and timed algebras. We provide an operational semantics for the new language (PTPA), and from this operational semantics we define a testing semantics based on the probability with which processes pass tests. Afterwards the induced testing equivalence is operationally ...
متن کاملFair Testing through Probabilistic Testing
In this paper we deene a probabilistic testing semantics which can be used to alternatively characterize fair testing. The key idea is to deene a probabilistic semantics in such a way that two non-probabilistic processes are fair equivalent ii any probabilistic version of both processes are equivalent in our probabilistic testing semantics. In order to get this result we deene a simple probabil...
متن کامل